Chemical Trees Minimizing Energy and Hosoya Index

نویسندگان

  • CLEMENS HEUBERGER
  • STEPHAN G. WAGNER
چکیده

Abstract. The energy of a molecular graph is a popular parameter that is defined as the sum of the absolute values of a graph’s eigenvalues. It is well known that the energy is related to the matching polynomial and thus also to the Hosoya index via a certain Coulson integral. Trees minimizing the energy under various additional conditions have been determined in the past, e.g., trees with a given diameter or trees with a perfect matching. However, it is quite a natural problem to minimize the energy of trees with bounded maximum degree—clearly, the case of maximum degree 4 (so-called chemical trees) is the most important one. We will show that the trees with given maximum degree that minimize the energy are the same that have been shown previously to minimize the Hosoya index and maximize the Merrifield-Simmons index, thus also proving a conjecture due to Fischermann et al. Finally, we show that the minimal energy grows linearly with the size of the trees, with explicitly computable growth constants that only depend on the maximum degree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 80 4 . 05 16 v 1 [ m at h . C O ] 3 A pr 2 00 8 CHEMICAL TREES MINIMIZING ENERGY AND HOSOYA INDEX

Abstract. The energy of a molecular graph is a popular parameter that is defined as the sum of the absolute values of a graph’s eigenvalues. It is well known that the energy is related to the matching polynomial and thus also to the Hosoya index via a certain Coulson integral. Trees minimizing the energy under various additional conditions have been determined in the past, e.g., trees with a gi...

متن کامل

On the number of independent subsets in trees with restricted degrees

We study the number of independent vertex subsets (known as the MerrifieldSimmons index in mathematical chemistry) and the number of independent edge subsets (called the Hosoya index) for trees whose vertex degrees are restricted to 1 or d (for some d ≥ 3), a natural restriction in the chemical context. We find that the minimum of the Merrifield-Simmons index and the maximum of the Hosoya index...

متن کامل

On a Class of Extremal Trees for Various Indices

It was recently shown that an interesting class of trees maximizes the MerrifieldSimmons index and minimizes the Hosoya index and energy among all trees with given number of vertices and maximum degree. In this paper, we describe how these trees (which we will call F-trees) can be constructed algorithmically by means of so-called F-expansions, which are very similar to ordinary base-d digital e...

متن کامل

A Unified Approach to Extremal Cacti for Different Indices

Abstract Many chemical indices have been invented in theoretical chemistry, such as Wiener index, Merrifield-Simmons index, Hosoya index, spectral radius and Randić index, etc. The extremal trees and unicyclic graphs for these chemical indices are interested in existing literature. Let G be a molecular graph (called a cacti), which all of blocks of G are either edges or cycles. Denote G (n, r) ...

متن کامل

On the minimal energy of trees with a given diameter

The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. Zhang et al (Discrete Appl. Math., 92(1999), 71-84) characterized the trees with a perfect matching having the minimal and the second minimal energies, which solved a conjecture proposed by Gutman (J. Math. Chem., 1(1987), 123-143). In this letter, for a given positive integer d we characterize t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008